Vessel passage scheduling through cascaded bridges using mixed-integer programming

This paper addresses the problem of guaranteeing efficient inland waterway transport in presence sequential movable bridges, which must be operated to grant vessel passage. The main contribution is formulation passage scheduling as a mixed-integer programming problem. algorithm receives widths and voyage plans, determines feasible through bridges that best matches plans. Process optimization carried out using rolling horizon implementation keep computationally tractable real-time applications. Finally, realistic case study based on Rhine-Alpine corridor used test approach demonstrate its effectiveness.